Minimizing and maximizing a linear objective function under a fuzzy $\max-\ast$ relational equation and an inequality constraint
نویسندگان
چکیده
منابع مشابه
Multi-objective optimization with a max-t-norm fuzzy relational equation constraint
In this project, we consider minimizing multiple linear objective functions under a max-t-norm fuzzy relational equation constraint. Since the feasible domain of a max-Archimedean t-norm relational equation constraint is generally nonconvex, traditionally mathematical programming techiniques may have difficulty in yielding efficient solutions for such problems. In this paper, we apply the two-p...
متن کاملLinear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints
In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملlinear objective function optimization with the max-product fuzzy relation inequality constraints
in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملLinear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints
In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is nonconvex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal so...
متن کاملAn efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2022
ISSN: ['1805-949X', '0023-5954']
DOI: https://doi.org/10.14736/kyb-2022-3-0320